Split embedding problems over complete domains
نویسندگان
چکیده
منابع مشابه
Lp Embedding and Nonlinear Eigenvalue Problems for Unbounded Domains
Let R denote real iV-dimensional Euclidean space. Then it is a well-known fact that the imbedding of the Sobolev space Wi,2(R) in LP(R ) is bounded for 2g>pS2N/(N-2), but is definitely not compact. Consequently the theory of critical points for general isoperimetric variational problems defined over arbitrary unbounded domains in R has been little investigated despite its importance. Indeed the...
متن کاملConstraint Satisfaction Problems over Numeric Domains
We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers. Examples of such problems are feasibility of linear programs, integer linear programming, the max-atoms problem, Hilbert’s tenth problem, and many more. Our particular focus is to identify those CSPs that can be solved in polynomial time, an...
متن کاملIntegral Complete Split Graphs
We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.
متن کاملComplete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches, the implementation is short and concise without giving up on the best known worst case time complexity. It is incremental and concurrent by nature of CHR. It is provably correct and confluent. It is independent of th...
متن کاملSubmodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains
Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs depending on a fixed set of allowed cost functions in the input. Recently, the computational complexity of all VCSPs for finite sets of cost functions over finite domains has been classified in this sense. Many natural optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics
سال: 2009
ISSN: 0003-486X
DOI: 10.4007/annals.2009.170.899